منابع مشابه
Elementary gates for quantum computation.
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values (x, y) to (x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2n)) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized D...
متن کاملElementary Gates for Quantum Computation
(quant-ph/9503007) 36] R. Landauer, \Is quantum mechanics useful?", Proc. Roy. Soc. Lond., (to be published). 37] The only non-trivial one-bit classical invertible operation is 0 1 1 0. 41] Corresponding with the deenition in the previous section, the top two wires contain the input bits x 1 and x 2 , and the third wire contains the input y). 42] The angle-halving of this deenition conforms to ...
متن کاملElementary Gates for Quantum Computation Tycho Sleator
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values (x; y) to (x; xy)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n)) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized D...
متن کاملArbitrary two-qubit computation in 23 elementary gates
We address the problem of constructing quantum circuits to implement an arbitrary two-qubit quantum computation. We pursue circuits without ancilla qubits and as small a number of elementary quantum gates as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2 controlled-NOT ~CNOT! gates. We also constructively prove a wor...
متن کاملComplexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates
We consider computation trees which admit as gate functions along with the usual arithmetic operations also algebraic or transcendental functions like exp, log, sin, square root (defined in the relevant domains) or much more general, Pfaffian functions. A new method for proving lower bounds on the depth of these trees is developed which allows to prove a lower bound Ω( √ logN) for testing membe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2007
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/40/31/f01